منابع مشابه
On Invariant Line Arrangements
We classify all arrangements of lines that are invariant under foliations of degree 4 of the real projective plane.
متن کاملOn shortest paths in line arrangements
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectured. This gives a linear-time algorithm for computing shortest paths in such arrangements.
متن کاملA Note on Coloring Line Arrangements
We show that the lines of every arrangement of n lines in the plane can be colored with O( √ n/ log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a Θ( √ log n) factor. Any further improvement on this bound would also improve the best known lower bound on the following problem of Erdős: estimate the maximum number of points in general po...
متن کاملLine Arrangements in H
If M = H3/G is a hyperbolic manifold and γ ⊂ M is a simple closed geodesic, then γ lifts to a collection of lines in H3 acted upon by G. In this paper we show that such a collection of lines cannot contain a particular type of subset (called a bad triple) unless G has orientation-reversing elements. This fact allows us to extend certain lower bounds on hyperbolic volume to the non-orientable case.
متن کاملOn-line seat reservations via off-line seating arrangements
When reservations are made to for instance a train, it is an on-line problem to accept or reject, i.e., decide if a person can be fitted in given all earlier reservations. However, determining a seating arrangement, implying that it is safe to accept, is an off-line problem with the earlier reservations and the current one as input. We develop optimal algorithms to handle problems of this nature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00430-2